计算机与现代化 ›› 2012, Vol. 1 ›› Issue (9): 170-173.doi: 10.3969/j.issn.1006-2475.2012.09.043

• 算法分析与设计 • 上一篇    下一篇

和声搜索算法在组合测试用例生成中的应用

李劲华1,杨永丽2,邢丹丹1   

  1. 1.青岛大学信息工程学院,山东青岛266071; 2.中国人民解放军91999部队,山东青岛266003
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2012-09-21 发布日期:2012-09-21

Application of Harmony Search Algorithm in Combinatorial Test Case Generation

LI Jin-hua1, YANG Yong-li2, XING Dan-dan1   

  1. 1. College of Information Engineering, Qingdao University, Qingdao 266071, China;2. Unit 91999 of PLA, Qingdao 266003, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2012-09-21 Published:2012-09-21

摘要: 一个复杂的软件系统通常受很多因素影响,它们之间的交互造成系统行为的复杂化和各种故障,要完全地测试这些交互组合,不切实际。组合测试技术考虑因素的不同交互对系统产生的不同影响,以最小的测试用例提高测试质量。本文提出一种根据和声搜索算法产生组合测试用例的方法,解决多维组合覆盖和可变强度组合覆盖的关键问题,并通过实验验证该方法的有效性。

关键词: 和声搜索, 组合测试, 测试用例集, 多元交互, 覆盖矩阵

Abstract: A complex software system is usually affected by a lot of factors. Their interactions complicate the system behavior and cause various faults. It is impossible to exhaustively test all the interactions. Combinatorial testing uses a small number of test cases to guarantee the test quality by considering the factors different influence on systems. The paper proposes a novel method of test suite generation based on harmony search algorithm. The method solves the key issues of N-way combinatorial coverage and variable-strength combinatorial coverage. The experiments demonstrate the effectiveness of the method.

Key words: harmony search, combinatorial testing, test suite, N-way interaction, covering array